Axiomatizability in Inclusive Equational Logic
نویسنده
چکیده
منابع مشابه
Axiomatizability of positive algebras of binary relations
We consider all positive fragments of Tarski’s representable relation algebras and determine whether the equational and quasiequational theories of these fragments are finitely axiomatizable in first-order logic. We also look at extending the signature with reflexive, transitive closure and the residuals of composition.
متن کاملCylindric algebras and relational databases
An interpretation of the relational data model and various dependencies is given within the framework of cylindric algebras. It turns out that there is a natural translation of relational databases into cylindric set lattices, and that Codd’s relational operators have a simple interpretation in these structures. Consequently, various database constraints can be expressed in the equational langu...
متن کاملOn the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, then there exists a (sound and complete) finite equational axiomatization for the process algebra BCCSP modulo ready trace semantics. We prove that if the alphabet is infinite, then such an axiomatization does not exist...
متن کاملSquares in Fork Arrow Logic
In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema’s non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork o...
متن کاملThe Equational Theory of Weak Complete Simulation Semantics over BCCSP
This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional groundcomplete axiomatizations for the weak complete simulation precongruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996